Using Efficient Boolean Algorithms for Mining Association Rules
نویسنده
چکیده
In this paper, we use transaction data as the source data of mining, and each transaction data contains a consumer ever buy items. We mine association rules from two aspects. One is to present a Boolean FP-tree algorithm to mine association rules with the Boolean computation according to the FP-tree algorithm and CDAR algorithm. The experiments show that the performances of our algorithm are faster than the FP-tree algorithm. The other is to let one transaction item as the target of mining, and to present a more efficient Boolean FP-tree-1 algorithm to mine association rules which contain the item than the Boolean FP-tree algorithm.
منابع مشابه
A new approach based on data envelopment analysis with double frontiers for ranking the discovered rules from data mining
Data envelopment analysis (DEA) is a relatively new data oriented approach to evaluate performance of a set of peer entities called decision-making units (DMUs) that convert multiple inputs into multiple outputs. Within a relative limited period, DEA has been converted into a strong quantitative and analytical tool to measure and evaluate performance. In an article written by Toloo et al. (2009...
متن کاملIntroducing an algorithm for use to hide sensitive association rules through perturb technique
Due to the rapid growth of data mining technology, obtaining private data on users through this technology becomes easier. Association Rules Mining is one of the data mining techniques to extract useful patterns in the form of association rules. One of the main problems in applying this technique on databases is the disclosure of sensitive data by endangering security and privacy. Hiding the as...
متن کاملMining Association Rules with Item Constraints
The problem of discovering association rules has received considerable research attention and several fast algorithms for mining association rules have been developed. In practice, users are often interested in a subset of association rules. For example, they may only want rules that contain a speci c item or rules that contain children of a speci c item in a hierarchy. While such constraints c...
متن کاملEvaluating Association Rules in Boolean Matrix Factorization
Association rules, or association rule mining, is a well-established and popular method of data mining and machine learning successfully applied in many different areas since mid-nineties. Association rules form a ground of the Asso algorithm for discovery of the first (presumably most important) factors in Boolean matrix factorization. In Asso, the confidence parameter of association rules hea...
متن کاملHierarchical Approach for Online Mining--Emphasis towards Software Metrics
---Several multi-pass algorithms have been proposed for Association Rule Mining from static repositories. However, such algorithms are incapable of online processing of transaction streams. In this paper we introduce an efficient single-pass algorithm for mining association rules, given a hierarchical classification amongest items. Processing efficiency is achieved by utilizing two optimization...
متن کامل